Construction of pseudorandom binary sequences using additive characters over GF(2 k )
نویسندگان
چکیده
منابع مشابه
Construction of pseudorandom binary sequences using additive characters over GF(2 k )
8th Central European Conference on Cryptography 20082
متن کاملConstruction of pseudorandom binary sequences over elliptic curves using multiplicative characters
In this paper the randomness of binary sequences generated over elliptic curve is studied. The construction uses multiplicative characters and both the well-distribution and correlation measures are estimated. 2000 Mathematics Subject Classification: Primary 11K45
متن کاملConstruction of pseudorandom binary lattices based on multiplicative characters
In this paper a large family of pseudorandom binary lattices is constructed by using the multiplicative characters of finite fields. This construction generalizes several one dimensional constructions to arbitrary dimension. 2000 Mathematics Subject Classification: Primary 11K45
متن کاملConcatenation of pseudorandom binary sequences
In the applications it may occur that our initial pseudorandom binary sequence turns out to be not long enough, thus we have to take the concatenation or merging of it with another pseudorandom binary sequences. Here our goal is study when can we form the concatenation of several pseudorandom binary sequences belonging to a given family? We introduce and study new measures which can be used for...
متن کاملRemarks on Pseudorandom Binary Sequences Over Elliptic Curves
In the paper the pseudorandomness of binary sequences defined over elliptic curves is studied and both the well-distribution and correlation measures are estimated. The paper is based on the KohelShparlinski bound and the Erdős-Turán-Koksma inequality. 2000 Mathematics Subject Classification: Primary 11K45
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Periodica Mathematica Hungarica
سال: 2008
ISSN: 0031-5303,1588-2829
DOI: 10.1007/s10998-008-7073-1